Reasoning about functional and full hierarchical dependencies over partial relations

نویسندگان

  • Flavio Ferrarotti
  • Sven Hartmann
  • Sebastian Link
چکیده

We study the implication problem for the combined class of functional and full hierarchical dependencies in the presence of SQL’s NOT NULL constraints. Two different notions of implication are addressed: one where a dependency is implied by the given set of dependencies plus the underlying schema, and one where a dependency is implied by the given set of dependencies alone. We establish axiomatizations for both notions of implication, and reveal deep relationships between them.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Armstrong Databases and Reasoning for Functional Dependencies and Cardinality Constraints over Partial Bags

Data dependencies capture meaningful information about an application domain within the target database. The theory of data dependencies is largely a theory over relations. To make data processing more efficient in practice, partial bags are permitted as database instances to accommodate partial and duplicate information. However, data dependencies interact differently over partial bags than ov...

متن کامل

Reasoning about Domain Semantics over Relations, Bags, Partial Relations, and Partial Bags

Quality database schemata must capture both the structure and semantics of the domain of interest. Classes of data dependencies have been studied extensively to model domain semantics. Traditionally, the theory of data dependencies has been limited to relations. In practice, duplicate and partial information are permitted to occur in database instances. These features are supported to make data...

متن کامل

An Efficient Algorithm for Reasoning about Fuzzy Functional Dependencies

A sound and complete Automated Prover for the Fuzzy Simplification Logic (FSL logic) is introduced and based on it a method for efficiently reasoning about fuzzy functional dependencies over domains with similarity relations. The complexity of the algorithm is the same as that of equivalent algorithms for crisp functional dependencies that appear in the literature.

متن کامل

Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes

We study inference systems for the combined class of functional and full hierarchical dependencies in relational databases. Two notions of implication are considered: the original version in which the underlying set of attributes is fixed, and the alternative notion in which this set is left undetermined. The first main result establishes a finite axiomatisation in fixed universes which clarifi...

متن کامل

Strong keys and functional dependencies in partial database relations

We study keys and functional dependencies in the context of partial relations that permit null values with the interpretation no information. Based on Codd’s principle of entity integrity we propose the class of strong keys over partial database relations. These keys enforce both uniqueness and totality of tuples. We study the interaction of strong keys with Lien, Atzeni and Morfuni’s classes o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 235  شماره 

صفحات  -

تاریخ انتشار 2013